# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def minPathCost(self, grid: List[List[int]], moveCost: List[List[int]]) -> int:
        m = len(grid)
        n = len(grid[0])

        dp = [[0] * n for _ in range(m)]

        for i in range(n):
            dp[0][i] = grid[0][i]

        for i in range(1, m):
            for j in range(n):
                values = []
                for k in range(n):
                    prev_row_cell_value = grid[i-1][k]
                    value = dp[i-1][k] + moveCost[prev_row_cell_value][j] + grid[i][j]
                    values.append(value)
                dp[i][j] = min(values)

        ans = min(dp[m-1])
        return ans


if __name__ == '__main__':
    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([[5, 3], [4, 0], [2, 1]], [[9, 8], [1, 5], [10, 12], [18, 6], [2, 4], [14, 3]], 17),
        ([[5, 1, 2], [4, 0, 3]], [[12, 10, 15], [20, 23, 8], [21, 7, 1], [8, 1, 13], [9, 10, 25], [5, 3, 2]], 6)
    ]

    for case_item in testcases:
        solution = Solution()
        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.minPathCost(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

